A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs by Jason Luu

نویسندگان

  • Jason Luu
  • Ian Kuon
  • Danny Paladino
چکیده

A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs Jason Luu Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto 2010 The complexity of Field-Programmable Gate Array (FPGAs) logic blocks have undergone constant evolution to the point where both the basic soft logic blocks that implement combinational logic and the fixed-function hard blocks contain complex interconnects, hierarchy and modes. The goal of this thesis is to both support that complexity and enable future architecture exploration of even increased complexity and new kinds of hard functionality. To accomplish this, a Computer-Aided Design (CAD) flow that can map a user circuit to an FPGA with these complex blocks is needed. We propose a new language that can describe these complex blocks and a new area-driven tool for the packing stage of that CAD flow. The packing stage groups components of a user circuit into the complex blocks available on the FPGA. We conduct experiments to illustrate the quality of the packing tool and to demonstrate the newly-enabled architecture exploration capabilities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High level compilation for fine grained FPGAs

Over the past several years, Field Programmable Gate Arrays (FPGAs) have functioned effectively as specialized processors capable of an order of magnitude improved performance over workstations a t a fraction of the cost. I t is widely recognized, however, that for FPGAs to gain acceptance in the software community as algorithm accelerator$, tools to create hardware realizations of those algori...

متن کامل

Technology Mapping for Heterogeneous FPGAs

Truly heterogenous FPGAs, those with two diierent kinds of logic block, don't exist in the commercial world in part because logic synthesis for them is diicult. The diiculty arises because FPGAs are prefabricated , and so the ratio of the number of each type of block is xed, which requires a constraint on the mapping that is not present for either homogenous FPGAs or ASICs. This paper presents ...

متن کامل

Vpr 5.0

The T-Vpack and VPR toolset [6, 7] have been widely used to perform FPGA CAD and architecture research, but have not evolved over the past decade to include many architectural features now present in modern FPGAs. This paper describes a new version of the toolset that includes four significant features: The router now supports a broad range of single-driver routing architectures [29, 4, 16] whi...

متن کامل

Implementation of Face Recognition Algorithm on Fields Programmable Gate Array Card

The evolution of today's application technologies requires a certain level of robustness, reliability and ease of integration. We choose the Fields Programmable Gate Array (FPGA) hardware description language to implement the facial recognition algorithm based on "Eigen faces" using Principal Component Analysis. In this paper, we first present an overview of the PCA used for facial recognition,...

متن کامل

Optimization of Fabric Layout by Using Imperialist Competitive Algorithm

In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010